Concurrency versus availability: atomicity mechanisms for replicated data

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Atomicity vs. availability : concurrency control for replicated data

Data managed by a distr ibuted program may be subject to consistency and availability requirements that must be satisfied in the presence of concurrency, site crashes, and network partit ions. This paper proposes two integrated methods for implementing concurrency control and replication for data of abstract type. Both methods use quorum consensus. The Consensus Locking method minimizes constra...

متن کامل

Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors

Data races do not cover all kinds of concurrency errors. This paper presents a data-flow-based technique to find stale-value errors, which are not found by low-level and high-level data race algorithms. Stale values denote copies of shared data where the copy is no longer synchronized. The algorithm to detect such values works as a consistency check that does not require any assumptions or anno...

متن کامل

Concurrency Control and View Notification Algorithms for Collaborative Replicated Objects

This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objects may be atomically updated, and these objects automatically maintain consistency with their replicas using an optimistic algorithm. Changes to these objects may be optimistically or pessimistically observed by view obj...

متن کامل

Concurrency Control and View Notiication Algorithms for Collaborative Replicated Objects

This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objects may be atomically updated, and these objects automatically maintain consistency with their replicas using an optimistic algorithm. Changes to these objects may be optimistically or pessimistically observed by view obj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Computer Systems

سال: 1987

ISSN: 0734-2071,1557-7333

DOI: 10.1145/24068.27643